Bounds on Positive Integral Solutions of Linear Diophantine Equations
نویسندگان
چکیده
Assuming the existence of a solution, we find bounds for small solutions x of the finite matrix equation Ax = B, where each entry of A, B is an integer, and x is a nontrivial column vector with nonnegative integer entries. 0. Introduction. In [1], [5] and [6] there arise in a topological setting, systems of linear equations with integer coefficients. The problem is to find a bound K depending on the coefficients only, such that if the given system has a nontrivial solution in nonnegative integers, then it has such a solution with all entries bounded by K. In [6] L. B. Treybig gives such a bound K using an inductive definition, and proves that a new solution can be found bounded by K and with the additional property that each entry is bounded by the corresponding entry of the given solution. The purpose of this paper is to find some easily stated bounds which are much smaller than those given by Treybig [6] but which do not satisfy necessarily the additional property. Notation. Throughout this paper A will denote an m X n matrix, B an m x 1 matrix, both with integral entries. We will consider the system of equations (1) Ax = B where x is a column whose entries are x,, . . . , xn. By (A\B) we denote the augmented matrix of the system (1). Let r denote the rank of A, Mx the maximum of the absolute values of all the minors of A of order r, M2 the maximum of the absolute values of all minors of order r of (A\B), and M the maximum of the absolute values of all the minors of {A\B). All our bounds will be stated in terms of m, «, Mx, M2, M, and therefore we may assume from now on without loss of generality that r = m < «. [x] will denote, as usual, the largest integer not exceeding x. Results. §1 is devoted to the case m = 1. We prove that the bound in this case is the maximum of the absolute value of the coefficients. It is easy to see that this bound is sharp. §2 considers the case r = n — 1 and we find the bound M2{1 + l/Mx). The homogeneous case, 5 = 0, is discussed in §3 and the bound M is obtained. Received by the editors June 21, 1974, and, in revised form, March 10, 1975. AMS (MOS) subject classifications (1970). Primary 15A06; Secondary 10B05.
منابع مشابه
A Generalization of a Theorem of Bumby on Quartic Diophantine Equations
Given a parametrized family of cubic models of elliptic curves Et over Q, it is a notoriously difficult problem to find absolute bounds for the number of integral points on Et (and, indeed, in many cases, it is unlikely such bounds even exist). Perhaps somewhat surprisingly, the situation is often radically different for quartic models. In a series of classical papers, Ljunggren (see e.g. [5] a...
متن کاملProcessor Lower Bound Formulas for Array Computations and Parametric Diophantine Systems
Using a directed acyclic graph (dag) model of algorithms, we solve a problem related to precedence-constrained multiprocessor schedules for array computations: Given a sequence of dags and linear schedules parametrized by n, compute a lower bound on the number of processors required by the schedule as a function of n. In our formulation, the number of tasks that are scheduled for execution duri...
متن کاملPositive Solutions to Some Systems of Diophantine Equations
We consider a sequence defined by the number of positive solutions to a sequence of systems of Diophantine equations. We derive some bounds on the solutions to demonstrate that the terms of the sequence are finite. We develop an algorithm for 1 computing an arbitrary term of the sequence, and consider a graph-theoretic approach to computing the same.
متن کاملSolving singular integral equations by using orthogonal polynomials
In this paper, a special technique is studied by using the orthogonal Chebyshev polynomials to get approximate solutions for singular and hyper-singular integral equations of the first kind. A singular integral equation is converted to a system of algebraic equations based on using special properties of Chebyshev series. The error bounds are also stated for the regular part of approximate solut...
متن کاملDiophantine Equations Related with Linear Binary Recurrences
In this paper we find all solutions of four kinds of the Diophantine equations begin{equation*} ~x^{2}pm V_{t}xy-y^{2}pm x=0text{ and}~x^{2}pm V_{t}xy-y^{2}pm y=0, end{equation*}% for an odd number $t$, and, begin{equation*} ~x^{2}pm V_{t}xy+y^{2}-x=0text{ and}text{ }x^{2}pm V_{t}xy+y^{2}-y=0, end{equation*}% for an even number $t$, where $V_{n}$ is a generalized Lucas number. This pape...
متن کاملA Generalized Fibonacci Sequence and the Diophantine Equations $x^2pm kxy-y^2pm x=0$
In this paper some properties of a generalization of Fibonacci sequence are investigated. Then we solve the Diophantine equations $x^2pmkxy-y^2pm x=0$, where $k$ is positive integer, and describe the structure of solutions.
متن کامل